Dynamic rank/select structures with applications to run-length encoded texts
نویسندگان
چکیده
منابع مشابه
Parallelization Strategy for Hierarchical Run Length Encoded Data Structures
An efficient parallelization strategy is presented for a Hierarchical Run Length Encoded (HRLE) data structure, implemented for the Sparse Field Level Set method. In order to achieve high parallel efficiency, computational work must be distributed evenly over all available CPU threads. Since the Level Set surface must be allowed to deform and evolve, thereby increasing the simulation area, ther...
متن کاملMatching for Run-Length Encoded Strings
1 Motivation Measuring the similarity between two strings, through such standard measures as Hamming distance, edit distance, and longest common subsequence, is one of the fundamental problems in pattern matching. We consider the problem of nding the longest common subsequence of two strings. A well-known dynamic programming algorithm computes the longest common subsequence of strings X and Y i...
متن کاملEdit distance of run-length encoded strings
Let X and Y be two run-length encoded strings, of encoded lengths k and l, respectively. We present a simple O(|X|l+|Y |k) time algorithm that computes their edit distance. 2002 Elsevier Science B.V. All rights reserved.
متن کاملBinary jumbled string matching for highly run-length compressible texts
The Binary Jumbled String Matching problem is defined as: Given a string s over {a, b} of length n and a query (x, y), with x, y non-negative integers, decide whether s has a substring t with exactly x a’s and y b’s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this i...
متن کاملThe Minisatellite Transformation Problem Revisited: A Run Length Encoded Approach
In this paper we present a more efficient algorithm for comparison of minisatellites which has complexity O(n′ + m′ + mn′ + nm′ +mn) where n and m are the lengths of the maps and n′ and m′ are the sizes of run-length encoded maps. We show that this algorithm makes a significant improvement for the real biological data, dividing the computing time by a factor 30 on a significant set of data.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.021